Erdős–Hajnal for graphs with no 5‐hole
نویسندگان
چکیده
The Erdős–Hajnal conjecture says that for every graph H $H$ there exists τ > 0 $\tau >0$ such G $G$ not containing as an induced subgraph has a clique or stable set of cardinality at least | $|G|^\tau$ . We prove this is true when cycle length five. also several further results: instance, if C $C$ and the complement forest, neither , $C,H$
منابع مشابه
Graphs with no P̄7-minor
Let P̄7 denote the complement of a path on seven vertices. We determine all 4-connected graphs that do not contain P̄7 as a minor.
متن کاملPerfect Graphs with No 2k 2 and No K 6
We prove that a 2K 2 minimal imperfect Berge graph (if any) contains a K 6 : A graph is perfect if the vertices of any induced subgraph H can be colored, in such a way that no two adjacent vertices receive the same color, with a number of colors (denoted by (H)) not exceeding the cardinality !(H) of a maximum clique of H. A graph is minimal imperfect if all its proper induced subgraphs are perf...
متن کاملComplete Bipartite Graphs with No Rainbow Paths
Motivated by questions in Ramsey theory, Thomason and Wagner described the edge colorings of complete graphs that contain no rainbow path Pt of order t. In this paper, we consider the edge colorings of complete bipartite graphs that contain no rainbow path Pt. Mathematics Subject Classification: 05C15, 05C38, 05C55
متن کاملAnother two graphs with no planar covers
A graph H is a cover of a graph G if there exists a mapping φ from V (H) onto V (G) such that φ maps the neighbors of every vertex v in H bijectively to the neighbors of φ(v) in G. Negami conjectured in 1986 that a connected graph has a finite planar cover if and only if it embeds in the projective plane. It follows from the results of Archdeacon, Fellows, Negami, and the author that the conjec...
متن کاملColouring graphs with no odd holes
An odd hole in a graph is an induced subgraph which is a cycle of odd length at least five. In 1985, A. Gyárfás made the conjecture that for all t there exists n such that every graph with no Kt subgraph and no odd hole is n-colourable. We prove this conjecture.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of The London Mathematical Society
سال: 2023
ISSN: ['1460-244X', '0024-6115', '1234-5678']
DOI: https://doi.org/10.1112/plms.12504